Combinatorial Constructions of Generating Functions of Cylindric Partitions with Small Profiles into Unrestricted or Distinct Parts
نویسندگان
چکیده
In this paper, cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions unrestricted distinct parts with these constructed. constructions combinatorial they connect the ordinary partitions.
منابع مشابه
Number theoretic properties of generating functions related to Dyson’s rank for partitions into distinct parts
Let Q(n) denote the number of partitions of n into distinct parts. We show that Dyson’s rank provides a combinatorial interpretation of the well-known fact that Q(n) is almost always divisible by 4. This interpretation gives rise to a new false theta function identity that reveals surprising analytic properties of one of Ramanujan’s mock theta functions, which in turn gives generating functions...
متن کاملThe Arithmetic of Partitions into Distinct Parts
so that Q(n) is odd if and only if n is a pentagonal number. This fact was generalized by Gordon and Ono [4], who demonstrated that for any positive integer k almost all values of Q(n) are divisible by 2k, and by Ono and Penniston [7], who found an exact formula for Q(n) modulo 8. Their techniques do not apply to odd primes, however, and for these primes the situation seems to be more difficult...
متن کاملMaximum Product Over Partitions Into Distinct Parts
We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the On-Line Encyclopedia of Integer Sequences).
متن کاملPartitions into Distinct Parts and Elliptic Curves
A positive integer D is called a ‘congruent number’ if there exists a right triangle with rational sidelengths with area D. Over the centuries there have been many investigations attempting to classify the congruent numbers, but little was known until Tunnell [T] brilliantly applied a tour de force of methods and provided a conditional solution to this problem. It turns out that a square-free i...
متن کاملA note on partitions into distinct parts and odd parts
Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/11287